The Stretch - Length Tradeoff in Geometric Networks: Worst-case and Average case Study
نویسندگان
چکیده
xxx Working notes. Three main things remain to do. (1) Either include Tamar’s argument [now in separate document] for Theorem 5, or replace by some better construction for worst-case upper bound. (2) Put in the average-case lower bound calculus calculations needed in section 6. (3) General version of the worst-case lower bound method in section 7.3. A fourth thing one might contemplate: (4) Is there a way to use Proposition 7 to get an upper bound in the worst case?
منابع مشابه
The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study
Consider a network linking the points of a rate-1 Poisson point process on the plane. Write ! (s) for the minimum possible mean length per unit area of such a network, subject to the constraint that the route-length between every pair of points is at most s times the Euclidean distance. We give upper and lower bounds on the function ! (s), and on the analogous “worst-case” function !(s) where t...
متن کاملAverage Stretch Factor: How Low Does It Go?
In a geometric graph, G, the stretch factor between two vertices, u and w, is the ratio between the Euclidean length of the shortest path from u to w in G and the Euclidean distance between u and w. The average stretch factor of G is the average stretch factor taken over all pairs of vertices in G. We show that for any set, V , of n points in Rd , there exists a geometric graph with vertex set ...
متن کاملInvestigation of Improvement in Georeferencing of Urban Analog Maps using the Geometric Elements and Genetic Algorithm
A large number of civil registries are available as analog maps that require georeferencing. Besides the quality of the analog maps and control points, the algorithm used for georeferencing also affects the accuracy of the map and the carried out geometrical calculations which indicates the need to study modern Georeferencing Methods. This requires the adoption of georeferencing optimization mo...
متن کاملS4: Small State and Small Stretch Routing Protocol for Large Wireless Sensor Networks
Routing protocols for wireless sensor networks must address the challenges of reliable packet delivery at increasingly large scale and highly constrained node resources. Attempts to limit node state can result in undesirable worst-case routing performance, as measured by stretch, which is the ratio of the hop count of the selected path to that of the optimal path. We present a new routing proto...
متن کامل